一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

Existence and characterization of regions minimizing perimeter under a volume constraint inside Euclidean cones

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.

We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.

     

Material compatibility constraints for make-to-order production planning

This paper defines a set of material compatibility constraints for use in order promising mixed integer programs. The constraints always represent a necessary condition for compatibility and, in certain cases, are both necessary and sufficient. The underlying analysis represents incompatibilities using bipartite graphs and applies results from the perfectly matchable subgraph polytope.     

Odd subgraphs and matchings

Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if deg_H(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.     

A transport model for the evolution of urban systems

When comparing an urban system to an elasto-plastic lattice, an analogy to the solid state of matter can be exploited using the concepts of the band theory similarly. Thereafter, the population dynamics – in a region of certain stability in the state space and within appropriate energy bands – can be described in terms of Cellular Automata, with two mobile agents or pseudo particles: the inhabitant (representative of an average individual) and the recurson (representative of its multidimensional resources). As in the solid state, transition rules take the form of two coupled transport equations, comprising the terms equivalent to the generation-recombination and circulation processes. The first process can be compared to a predator–prey growth model, typical of Ecology; whereas the circulation process – composed of a drift component and a diffusion component – should be compared to the concentration-sprawl demographic balance seen in urban occupation and dynamics. Thus, it needs to be defined and determined an urban potential function, an equivalent population charge, mobility and diffusion parameters, as well as net growth factors. This analogy, discussed within the context of a case study for Great Mendoza, plausibly explains the varied growth rates of the political departments, as well as the principal urban trends for spatial occupation.     

Multiple factor analysis in environmental chemistry

In environmental chemistry studies, it may be necessary to analyze data sets constituted by different blocks of variables, possibly of different types, measured on the same samples. Multiple factor analysis (MFA) is presented as a tool for exploring such data. The most important features of MFA are shown on a real environmental data set, consisting of two blocks of data, namely heavy metals and polycyclic aromatic hydrocarbons, measured for sediment samples. They are discussed and compared to principal component analysis (PCA). The usefulness of the weighting scheme used in MFA as a preprocessing step for other chemometric methods, such as clustering, is also highlighted.     

NANOMECHANICAL MAPPING OF CARBON BLACK REINFORCED NATURAL RUBBER BY ATOMIC FORCE MICROSCOPY

Atomic force microscopy （AFM） has the advantage of obtaining mechanical properties as well as topographic information at the same time. By analyzing force-distance curves measured over two-dimensional area using Hertzian contact mechanics, Young＇s modulus mapping was obtained with nanometer-scale resolution. Furthermore, the sample deformation by the force exerted was also estimated from the force-distance curve analyses. We could thus reconstruct a real topographic image by incorporating apparent topographic image with deformation image. We applied this method to carbon black reinforced natural rubber to obtain Young＇s modulus distribution image together with reconstructed real topographic image. Then we were able to recognize three regions; rubber matrix, carbon black （or bound rubber） and intermediate regions. Though the existence of these regions had been investigated by pulsed nuclear magnetic resonance, this paper would be the first to report on the quantitative evaluation of the interfacial region in real space.